Unusual algorithms for lexicographical enumeration

Using well-known results, we consider algorithms for finding minimal words of given length n in regular and context-free languages. We also show algorithms enumerating the words of given length n of regular and contextfree languages in lexicographical order

A novel cryptosystem based on Gluškov product of automata

The concept of Gluškov product was introduced by V. M. Gluškov in 1961. It was intensively studied by several scientists (first of all, by Ferenc Gécseg and the automata-theory school centred around him in Szeged, Hungary) since the middle of 60’s. In spite of the large number of excellent publications, no application of Gluškov-type products of automata in cryptography has arisen so far. This paper is the first attempt in this direction

A Chomsky-Schützenberger-Stanley type characterization of the class of slender context-free languages

Slender context-free languages have a complete algebraic characterization by L. Ilie in [13]. In this paper we give another characterization of this class of languages. In particular, using linear Dyck languages instead of unrestricted ones, we obtain a Chomsky-Schützenberger-Stanley type characterization of slender context-free languages